Arnoux-rauzy Subshifts: Linear Recurrence, Powers, and Palindromes
نویسندگان
چکیده
منابع مشابه
Episturmian words: a survey
In this paper, we survey the rich theory of infinite episturmian words which generalize to any finite alphabet, in a rather resembling way, the well-known family of Sturmian words on two letters. After recalling definitions and basic properties, we consider episturmian morphisms that allow for a deeper study of these words. Some properties of factors are described, including factor complexity, ...
متن کاملFactor Complexity of S-adic sequences generated by the Arnoux-Rauzy-Poincaré Algorithm
The Arnoux-Rauzy-Poincaré multidimensional continued fraction algorithm is obtained by combining the Arnoux-Rauzy and Poincaré algorithms. It is a generalized Euclidean algorithm. Its three-dimensional linear version consists in subtracting the sum of the two smallest entries to the largest if possible (Arnoux-Rauzy step), and otherwise, in subtracting the smallest entry to the median and the m...
متن کاملA Generalization of Sturmian Sequences; Combinatorial Structure and Transcendence∗
In this paper we study dynamical properties of a class of uniformly recurrent sequences on a k-letter alphabet with complexity p(n) = (k − 1)n + 1. These sequences, originally defined by P. Arnoux and G. Rauzy, are a natural generalization of the (binary) Sturmian sequences of Morse and Hedlund. We give two combinatorial algorithms for constructing characteristic Arnoux-Rauzy sequences. The fir...
متن کاملPalindromic complexity of infinite words associated with simple Parry numbers
A simple Parry number is a real number β > 1 such that the Rényi expansion of 1 is finite, of the form dβ(1) = t1 · · · tm. We study the palindromic structure of infinite aperiodic words uβ that are the fixed point of a substitution associated with a simple Parry number β. It is shown that the word uβ contains infinitely many palindromes if and only if t1 = t2 = · · · = tm−1 ≥ tm. Numbers β sat...
متن کاملA generalized palindromization map in free monoids
The palindromization map ψ in a free monoid A was introduced in 1997 by the first author in the case of a binary alphabet A, and later extended by other authors to arbitrary alphabets. Acting on infinite words, ψ generates the class of standard episturmian words, including standard ArnouxRauzy words. In this paper we generalize the palindromization map, starting with a given code X over A. The ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007